Feedback vertex set - PDFSEARCH.IO - Document Search Engine

Feedback vertex set
Results: 43

#	Item
11	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:05 NP-complete problems Clique Travelling salesman problem Vertex cover NP-complete Cut Path decomposition Feedback vertex set Graph theory Theoretical computer science Mathematics
12	MARCH 14, Rigid Formations with Leader-Follower Architecture Tolga Eren, Walter Whiteley, and Peter N. Belhumeur Add to Reading List Source URL: www1.cs.columbia.edu Language: English - Date: 2008-10-11 12:20:44 Degree Adjacency matrix Cycle graph Loop Directed graph Directed acyclic graph Connectivity Feedback vertex set Petersen graph Graph theory Graph Vertex
13	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:58:10 NP-complete problems Analysis of algorithms Parameterized complexity Complexity classes Kernelization Dominating set Feedback vertex set Michael Fellows Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
14	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
15	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics
16	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:58 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Bidimensionality Dominating set Tree decomposition Path decomposition Feedback vertex set Theoretical computer science Computational complexity theory Graph theory
17	Discrete Mathematics–252 www.elsevier.com/locate/disc Forbidden minors to graphs with small feedback sets Michael J. Dinneena;∗ , Kevin Cattellb , Michael R. Fellowsb Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Planar graphs Feedback vertex set Forbidden graph characterization Permutation graph Tree Graph Graph theory Graph operations Path decomposition
18	0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Add to Reading List Source URL: mrfellows.net Language: English - Date: 2009-09-08 08:50:37 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory
19	Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§ Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2009-10-29 15:21:24 NP-complete problems Vertex cover Feedback vertex set Independent set Matching Maximal independent set Parameterized complexity Algorithm Dominating set Theoretical computer science Mathematics Computational complexity theory
20	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:09 NP-complete problems Bidimensionality Parameterized complexity Kernelization Branch-decomposition Path decomposition Tree decomposition Clique Feedback vertex set Graph theory Theoretical computer science Mathematics

UPDATE